Search results for "SPQR tree"

showing 1 items of 1 documents

Tree automata, tree decomposition and hyperedge replacement

2005

Recent results concerning efficient solvability of graph problems on graphs with bounded tree-width and decidability of graph properties for hyperedge-replacement graph grammars are systematised by showing how they can be derived from recognisability of corresponding tree classes by finite tree automata, using only well-known techniques from tree-automata theory.

Discrete mathematicsSPQR treeSpanning treeK-ary treeComputer scienceTree decompositionCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTree structureGomory–Hu treeTree automatonGraph propertyComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct